#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 1e6 + 5;

int n, m;
int a[N];
bool check(int x) {
  ll sum = 0;
  rep(i, 1, n) sum += max(0, a[i] - x);
  return sum >= m;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  rep(i, 1, n) cin >> a[i];
  int l = 1, h = 400000;
  while (l <= h) {
    int mid = (l + h) >> 1;
    if (check(mid))
      l = mid + 1;
    else
      h = mid - 1;
  }
  cout << h;
  return 0;
}